Branches in random recursive k-ary trees
Authors
Abstract:
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
similar resources
branches in random recursive k-ary trees
in this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. we also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
full textDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
full textRecursive Generation of k-ary Trees
In this paper we present a construction of every k-ary tree using a forest of (k− 1)ary trees satisfying a particular condition. We use this method recursively for the construction of the set of k-ary trees from the set of (k−1)-Dyck paths, thus obtaining a new bijection φ between these two sets. Furthermore, we introduce a new order on [k]∗ which is used for the full description of this biject...
full textThe total Steiner k-distance for b-ary recursive trees and linear recursive trees
We prove a limit theorem for the total Steiner k-distance of a random b-ary recursive tree with weighted edges. The total Steiner k-distance is the sum of all Steiner k-distances in a tree and it generalises the Wiener index. The limit theorem is obtained by using a limit theorem in the general setting of the contraction method. In order to use the contraction method we prove a recursion formul...
full textON THE EXTERNAL PATH LENGTH OF RANDOM RECURSIVE k-ARY TREES
In this paper, we determine the expectation and variance of Xn the external path length in a random recursive k-ary tree of size n.
full textLongest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees
Let r and d be positive integers with r < d. Consider a random d-ary tree constructed as follows. Start with a single vertex, and in each time-step choose a uniformly random leaf and give it d newly created offspring. Let Td,t be the tree produced after t steps. We show that there exists a fixed δ < 1 depending on d and r such that almost surely for all large t , every r-ary subtree of Td,t has...
full textMy Resources
Journal title
volume 38 issue 2
pages 323- 331
publication date 2012-07-15
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023